package com.fr.lintcode;

public class Q1664 {

    /**
     * @param head: 
     * @return: nothing
     */
    public int countNodesII(ListNode head) {
        // 
    	int count = 0;
    	while(head != null) {
    		if(head.val > 0 && (head.val & 1) == 1) {
    			count ++;
    		}
    		head = head.next;
    	}
    	return count;
    }


}
